The Fréchet distance between multivariate normal distributions
نویسندگان
چکیده
منابع مشابه
Computing the Fréchet Distance between Folded Polygons
We present the first results showing that the Fréchet distance between non-flat surfaces can be approximated within a constant factor in polynomial time. Computing the Fréchet distance for surfaces is a surprisingly hard problem. It is not known whether it is computable, it has been shown to be NP-hard, and the only known algorithm computes the Fréchet distance for flat surfaces (Buchin et al.)...
متن کاملOn bounds for the Fisher-Rao distance between multivariate normal distributions
Information geometry is approached here by considering the statistical model of multivariate normal distributions M as a Riemannian manifold with the natural metric provided by the Fisher information matrix. This differential geometric approach to probability theory, introduced by C. Rao in 1945, have been recently applied to different domains such as statistical inference, mathematical program...
متن کاملOn Computing the Fréchet Distance Between Surfaces
We describe two (1 + ε)-approximation algorithms for computing the Fréchet distance between two homeomorphic piecewise linear surfaces R and S of genus zero and total complexity n, with Fréchet distance δ. 1. A 2 (( n+ Area(R)+Area(S) (εδ)2 )2) time algorithm if R and S are composed of fat triangles (triangles with angles larger than a constant). 2. An O(D/(εδ)2) · n + 2O(D/(εδ)) time algorithm...
متن کاملComputing the Fréchet distance between simple polygons
We present the first polynomial-time algorithm for computing the Fréchet distance for a non-trivial class of surfaces: simple polygons. For this, we show that it suffices to consider homeomorphisms that map an arbitrary triangulation of one polygon to the other polygon such that diagonals of the triangulation are mapped to shortest paths in the other polygon.
متن کاملClustering Multivariate Normal Distributions
In this paper, we consider the task of clustering multivariate normal distributions with respect to the relative entropy into a prescribed number, k, of clusters using a generalization of Lloyd’s k-means algorithm [1]. We revisit this information-theoretic clustering problem under the auspices of mixed-type Bregman divergences, and show that the approach of Davis and Dhillon [2] (NIPS*06) can a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 1982
ISSN: 0047-259X
DOI: 10.1016/0047-259x(82)90077-x